Quantum Dynamic Mechanism-based Parallel Ant Colony Optimization Algorithm

نویسندگان

  • Xiaoming You
  • Sheng Liu
  • Yu-ming Wang
چکیده

A novel Parallel Ant Colony Optimization Algorithm based on Quantum dynamic mechanism for traveling salesman problem (PQACO) is proposed. The use of the improved 3-opt operator provides this methodology with superior local search ability; several antibody diversification schemes were incorporated into the PQACO in order to improve the balance between exploitation and exploration. We describe the quantum dynamic mechanism and analysis the technology of improving performance, the efficiency of the approach has been illustrated by applying to TSP benchmark instances Chn144.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New Ant Colony Algorithm Method based on Mutation for FPGA Placement Problem

Many real world problems can be modelled as an optimization problem. Evolutionary algorithms are used to solve these problems. Ant colony algorithm is a class of evolutionary algorithms that have been inspired of some specific ants looking for food in the nature. These ants leave trail pheromone on the ground to mark good ways that can be followed by other members of the group. Ant colony optim...

متن کامل

A Non-dominated Sorting Ant Colony Optimization Algorithm Approach to the Bi-objective Multi-vehicle Allocation of Customers to Distribution Centers

Distribution centers (DCs) play important role in maintaining the uninterrupted flow of goods and materials between the manufacturers and their customers.This paper proposes a mathematical model as the bi-objective capacitated multi-vehicle allocation of customers to distribution centers. An evolutionary algorithm named non-dominated sorting ant colony optimization (NSACO) is used as the optimi...

متن کامل

Parallel ACO with a Ring Neighborhood for Dynamic TSP

The current paper introduces a new parallel computing technique based on ant colony optimization for a dynamic routing problem. In the dynamic traveling salesman problem the distances between cities as travel times are no longer fixed. The new technique uses a parallel model for a problem variant that allows a slight movement of nodes within their Neighborhoods. The algorithm is tested with suc...

متن کامل

Optimization of the total annual cost in a shell and tube heat exchanger by Ant colony optimization technique

This paper examines the total annual cost from economic view heat exchangers based on ant colony optimization algorithm and compared the using optimization algorithm in the design of economic optimization of shell and tube heat exchangers. A shell and tube heat exchanger optimization design approach is expanded based on the total annual cost measured that divided to area of surface and power co...

متن کامل

Collection Path Ant Colony Optimization for Multi - agent Static Task Allocation ?

Mutual cooperation in Multi-Agent Systems is an important means to implement complex applications. The static task allocation is one of the key issues in agent cooperation mechanism. The latency of the network infrastructure, dynamic topology and node heterogeneity are important features of the agent system, and they bring new challenges to the static task allocation in multi-agent environment....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Int. J. Computational Intelligence Systems

دوره 3  شماره 

صفحات  -

تاریخ انتشار 2010